Fast Iterative Reconstruction for MRI from Nonuniform k-space Data
نویسندگان
چکیده
In magnetic resonance imaging (MRI), methods that use a non-Cartesian (e.g. spiral) sampling grid in k-space are becoming increasingly important. Reconstruction is usually performed by resampling the data onto a Cartesian grid. In this paper we compare the standard approach (gridding) and an approach based on an implicit discretisation. We show that both methods can be solved efficiently with the fast Fourier transform for nonequispaced knots. EDICS Categorie BMI-MRIM (Biomedical Imaging, Magnetic resonance imaging)
منابع مشابه
Fast, iterative, field-corrected image reconstruction for MRI
Magnetic field inhomogeneities cause distortions in the reconstructed images for non-cartesian k-space MRI (using spirals, for example). Several noniterative methods are currently used to compensate for the off-resonance during the reconstruction, but these methods rely on the assumption of a smoothly varying field map. Recently, iterative methods have been proposed that do not rely on this ass...
متن کاملTHE FAST SINC TRANSFORM AND IMAGE RECONSTRUCTION FROM NONUNIFORM SAMPLES IN k-SPACE
A number of problems in image reconstruction and image processing can be addressed, in principle, using the sinc kernel. Since the sinc kernel decays slowly, however, it is generally avoided in favor of some more local but less precise choice. In this paper, we describe the fast sinc transform, an algorithm which computes the convolution of arbitrarily spaced data with the sinc kernel in O.N lo...
متن کاملImproving Non-Cartesian MRI Reconstruction through Discontinuity Subtraction
Non-Cartesian sampling is widely used for fast magnetic resonance imaging (MRI). Accurate and fast image reconstruction from non-Cartesian k-space data becomes a challenge and gains a lot of attention. Images provided by conventional direct reconstruction methods usually bear ringing, streaking, and other leakage artifacts caused by discontinuous structures. In this paper, we tackle these probl...
متن کاملNon-Iterative Regularized reconstruction Algorithm for Non-CartesiAn MRI: NIRVANA.
We introduce a novel noniterative algorithm for the fast and accurate reconstruction of nonuniformly sampled MRI data. The proposed scheme derives the reconstructed image as the nonuniform inverse Fourier transform of a compensated dataset. We derive each sample in the compensated dataset as a weighted linear combination of a few measured k-space samples. The specific k-space samples and the we...
متن کاملSampling density compensation in MRI: rationale and an iterative numerical solution.
Data collection of MRI which is sampled nonuniformly in k-space is often interpolated onto a Cartesian grid for fast reconstruction. The collected data must be properly weighted before interpolation, for accurate reconstruction. We propose a criterion for choosing the weighting function necessary to compensate for nonuniform sampling density. A numerical iterative method to find a weighting fun...
متن کامل